Integer programming
An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming, which is also known as mixed integer programming.
Integer programming is NP-hard. A special case, 0-1 integer linear programming, in which unknowns are binary, is one of the Karp's 21 NP-complete problems.
Further reading
- George L. Nemhauser; Laurence A. Wolsey (1988). Integer and combinatorial optimization. Wiley. ISBN 9780471828198.
- Alexander Schrijver (1998). Theory of linear and integer programming. John Wiley and Sons. ISBN 9780471982326.
- Laurence A. Wolsey (1998). Integer programming. Wiley. ISBN 9780471283669.
- Dimitris Bertsimas; Robert Weismantel (2005). Optimization over integers. Dynamic Ideas. ISBN 9780975914625.
- John K. Karlof (2006). Integer programming: theory and practice. CRC Press. ISBN 9780849319143.
- H. Paul Williams (2009). Logic and Integer Programming. Springer. ISBN 9780387922799.
- Michael Jünger, Thomas M. Liebling, Denis Naddef, George Nemhauser, William R. Pulleyblank, et al., ed (2009). 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art. Springer. ISBN 9783540682745.
- Der-San Chen; Robert G. Batson; Yu Dang (2010). Applied Integer Programming: Modeling and Solution. John Wiley and Sons. ISBN 9780470373064.
External links
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Categories (Algorithms · Methods · Heuristics) · Software
|
|
‹The stub template below has been proposed for renaming to . See stub types for deletion to help reach a consensus on what to do.
Feel free to edit the template, but the template must not be blanked, and this notice must not be removed, until the discussion is closed. For more information, read the guide to deletion.›